Waiting times in nonpreemptive M k / Gk / 1 /

This paper studies and gives an analysis of a particular queuing model. It considers a non-preemptive priority queuing system with K ( ≥ 2 ) classes of jobs. The system consists of a single processor. It represents the model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedule jobs arriving according to a Markov arrival process. The process of service is arbitrary. With each job are associated a particular endogenous dynamic priorities, called scheduling by bounded priorities in mean with arrival pattern and denoted MBPAP. Our goal is, for the case of an arrival pattern of jobs, to give an original preemptive scheduling strategy and the behavior of the waiting time wk(t). We will investigate this queuing system.